Problem decomposition for reuse
نویسندگان
چکیده
An approach to software development problems is presented, and illustrated by an example. The approach is based on the ideas of problem frames and structuring speci cations by views. It is claimed that decompositions obtained by this approach result in a more e ective separation of concerns, and that the resulting components are more likely to be reusable than those obtained by more conventional approaches. The characteristics of desirable integration mechanisms are discussed, together with some other considerations arising out of the approach presented.
منابع مشابه
Automated Problem Decomposition for the Boolean Domain with Genetic Programming
Researchers have been interested in exploring the regularities and modularity of the problem space in genetic programming (GP) with the aim of decomposing the original problem into several smaller subproblems. The main motivation is to allow GP to deal with more complex problems. Most previous works on modularity in GP emphasise the structure of modules used to encapsulate code and/or promote c...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملScenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...
متن کاملA Benders Decomposition Method to Solve an Integrated Logistics Network Designing Problem with Multiple Capacities
In this paper, a new model is proposed for the integrated logistics network designing problem. In many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. However, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. Usually the c...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملOptimal Scheduling and Antenna Configuration
My dissertation examines algorithms for optimal spatial reuse TDMA scheduling with reconfigurable directional antennas. I present and solve the joint beam steering and scheduling problem for spatial reuse TDMA and describe a prototype implemented system based on the algorithms developed. The current prototype achieves up to a 600% speedup over TDMA with a mean of 234% in the experiments to date...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Software Engineering Journal
دوره 11 شماره
صفحات -
تاریخ انتشار 1996